package com.base;

/**
 * Created by yijy on 2017/10/9.
 */
public class TestInit {

    TestInit() {
        TestInit testInit = new TestInit();
    }

    int[]  arr = new int[10];

    public int f(){
        return 1;
    }

    public int g(){
        return 1;
    }

    public static void main(String[] args) {

        fibonacci(a1,a2,13);
    }

    public static int a1=1;
    public static int a2=1;

    public static void fibonacci(int a1,int a2,int an){
        int temp =a1+a2;
        if(a1==1&&a2==1){
            System.out.print(a1+"\t"+a2+"\t");
        }
        if(an==temp){
            System.out.print(temp+"\t");
        }else if(an<temp){
            System.out.println("不是fibonacci");
        }else{
            System.out.print(temp+"\t");
            fibonacci(a2,temp,an);
        }
    }

    public static void vampireNumber(){
        for(int i=1001;i<=9999;i++){
            if(i%100==0){
                continue;
            }

        }
    }

    public static int mod(int a){
        if(a/10>0)
            return mod(a/10);
        else
            return a/10;
    }

}
